Graph Transductions and Typological Gaps in Morphological Paradigms
نویسنده
چکیده
Several typological gaps have attracted a lot of interest in the linguistic literature recently. These concern the Person Case Constraint and the absence of ABA patterns in adjectival gradation, pronoun suppletion, case syncretism, and singular noun allomorphy, among others. This paper is the first to provide a unified explanation of all these phenomena, and it does so via weakly non-inverting graphtransductions. A pattern P is absent from the typology whenever such transductions cannot produce the graph corresponding to P from some fixed underlying base graph. I show that weakly non-inverting graphtransductions are particularly simple from a computational perspective, and consequently all these typological gaps follow from general simplicity desiderata.
منابع مشابه
Finite-state Composition of French Verb Morphology
This paper gives a novel account of French verb morphology as a composition of nite-state constraints. It consists of a cascade of transductions, each one dedicated to a speciic and linguistically motivated task. Each transducer expresses a number of linguistic generalizations that can be shared between various in-ectional paradigms, traditionally classiied separately. The sequence of ordered t...
متن کاملAdventures in Multilingual Parsing
The typological diversity of the world’s languages poses important challenges for the techniques used in machine translation, syntactic parsing and other areas of natural language processing. Statistical models developed and tuned for English do not necessarily perform well for richly inflected languages, where larger morphological paradigms and more flexible word order gives rise to data spars...
متن کاملDeveloping a database of personal and demonstrative pronoun paradigms: Conceptual and technical challenges
This paper explores the linguistic and technical challenges in creating a typological database for demonstrative and personal pronouns. Our database identifies a fundamental difference between morphological (or semantic) features that are relatively fixed across languages and those that are highly variable from one language to the next.
متن کاملMonadic Second-Order Definable Graph Transductions: A Survey
Courcelle, B., Monadic second-order definable graph transductions: a survey, Theoretical Computer Science 126 (1994) 53-75. Formulas of monadic second-order logic can be used to specify graph transductions, i.e., multivalued functions from graphs to graphs. We obtain in this way classes of graph transductions, called monadic second-order definable graph transductions (or, more simply, d&able tr...
متن کاملMorphotactics as Tier-Based Strictly Local Dependencies
It is commonly accepted that morphological dependencies are finite-state in nature. We argue that the upper bound on morphological expressivity is much lower. Drawing on technical results from computational phonology, we show that a variety of morphotactic phenomena are tierbased strictly local and do not fall into weaker subclasses such as the strictly local or strictly piecewise languages. Si...
متن کامل